Correction to: Enhanced Multiple-Point Statistical Simulation with Backtracking, Forward Checking and Conflict-Directed Backjumping
نویسندگان
چکیده
منابع مشابه
Minimal Forward Checking with Backmarking and Conflict-Directed Backjumping
Recently Dent and Mercer have introduced an algorithm called minimal forward checking (MFC) which always performs no worse than forward checking (FC) in terms of number of compatibility checks and node expanded given the same variable and value orderings. In this paper we describe an algorithm which extends MFC with backmarking and conflict-directed backtracking. The new algorithm has a smaller...
متن کاملConflict-Directed Backjumping Revisited
In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classiied as look-ahead schemes and look-back schemes. Unfortunately , look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-...
متن کاملConflict Directed Backjumping for Max-CSPs
Constraint Optimization problems are commonly solved using a Branch and Bound algorithm enhanced by consistency maintenance procedures (Wallace and Freuder 1993; Larrosa and Meseguer 1996; Larrosa et al. 1999; Larrosa and Schiex 2003; 2004). All these algorithms traverse the search space in a chronological order and gain their efficiency from the quality of the consistency maintenance procedure...
متن کاملHybrid Algorithms for the Constraint Satisfaction Problem
It might be said that there are five basic tree search algorithms for the constraint satisfaction problem (csp), namely, naive backtracking (BT), backjumping (BJ), conflict-directed backjumping (CBJ), backmarking (BM), and forward checking (FC). In broad terms, BT, BJ, and CBJ describe different styles of backward move (backtracking), whereas BT, BM, and FC describe different styles of forward ...
متن کاملConnict-directed Backjumping Revisited
In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classi ed as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Geosciences
سال: 2018
ISSN: 1874-8961,1874-8953
DOI: 10.1007/s11004-018-9767-5